118 research outputs found

    Debuggers and Performance Tools

    Get PDF

    Π˜Π½Ρ‚Π΅Π»Π»Π΅ΠΊΡ‚ΡƒΠ°Π»ΡŒΠ½Ρ‹ΠΉ ΠΌΠΎΠ½ΠΈΡ‚ΠΎΡ€ΠΈΠ½Π³ распрСдСлСнных тСхнологичСских ΠΎΠ±ΡŠΠ΅ΠΊΡ‚ΠΎΠ² с использованиСм ΠΈΠ½Ρ„ΠΎΡ€ΠΌΠ°Ρ†ΠΈΠΎΠ½Π½Ρ‹Ρ… ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ состояния

    Get PDF
    Π Π°Π±ΠΎΡ‚Π° посвящСна вопросам построСния ΠΈΠ½Ρ‚Π΅Π»Π»Π΅ΠΊΡ‚ΡƒΠ°Π»ΡŒΠ½Ρ‹Ρ… систСм ΠΌΠΎΠ½ΠΈΡ‚ΠΎΡ€ΠΈΠ½Π³Π° ΠΊΡ€ΡƒΠΏΠ½ΠΎΠΌΠ°ΡΡˆΡ‚Π°Π±Π½Ρ‹Ρ… распрСдСлСнных тСхнологичСских ΠΎΠ±ΡŠΠ΅ΠΊΡ‚ΠΎΠ². ΠžΡ‚Π»ΠΈΡ‡ΠΈΡ‚Π΅Π»ΡŒΠ½ΠΎΠΉ ΠΎΡΠΎΠ±Π΅Π½Π½ΠΎΡΡ‚ΡŒΡŽ Ρ‚Π°ΠΊΠΈΡ… систСм ΠΎΡ‚ систСм класса АБУ ВП являСтся Π½Π΅ΠΎΠ±Ρ…ΠΎΠ΄ΠΈΠΌΠΎΡΡ‚ΡŒ опрСдСлСния фактичСского глобального состояния систСмы, ΠΏΡ€Π΅Π΄ΠΏΠΎΠ»Π°Π³Π°ΡŽΡ‰Π΅Π³ΠΎΡΡ Π½Π΅ΠΈΠ·ΠΌΠ΅Π½Π½Ρ‹ΠΌ Π½Π° ΠΏΠ΅Ρ€ΠΈΠΎΠ΄ Π³ΠΎΡ€ΠΈΠ·ΠΎΠ½Ρ‚Π° планирования. Π—Π½Π°Π½ΠΈΠ΅ фактичСского глобального состояния систСмы ΠΌΠΎΠΆΠ΅Ρ‚ Π±Ρ‹Ρ‚ΡŒ использовано для Ρ€Π΅ΡˆΠ΅Π½ΠΈΡ Ρ€Π°Π·Π»ΠΈΡ‡Π½Ρ‹Ρ… комплСксных ΠΎΠΏΡ‚ΠΈΠΌΠΈΠ·Π°Ρ†ΠΈΠΎΠ½Π½Ρ‹Ρ… Π·Π°Π΄Π°Ρ‡. Π•Π³ΠΎ прСдставлСниС Π² систСмС Π½Π°Π·Π²Π°Π½ΠΎ ΠΈΠ½Ρ„ΠΎΡ€ΠΌΠ°Ρ†ΠΈΠΎΠ½Π½ΠΎΠΉ модСлью состояния. Π˜Π½Ρ„ΠΎΡ€ΠΌΠ°Ρ†ΠΈΠΎΠ½Π½Π°Ρ модСль систСмы конструируСтся динамичСски ΠΈΠ· ΠΈΠ½Ρ„ΠΎΡ€ΠΌΠ°Ρ†ΠΈΠΎΠ½Π½ΠΎΠΉ ΠΌΠΎΠ΄Π΅Π»ΠΈ ΠΎΠ±ΡŠΠ΅ΠΊΡ‚Π° ΠΈ Π²Ρ€Π΅ΠΌΠ΅Π½Π½Ρ‹Ρ… рядов Π·Π½Π°Ρ‡Π΅Π½ΠΈΠΉ ΠΏΠ°Ρ€Π°ΠΌΠ΅Ρ‚Ρ€ΠΎΠ² ΠΈ событий. Π’ качСствС ΠΏΡ€ΠΈΠΌΠ΅Ρ€Π° рассмотрСна Π·Π°Π΄Π°Ρ‡Π° ΠΎΠΏΡ‚ΠΈΠΌΠΈΠ·Π°Ρ†ΠΈΠΈ ΠΌΠ°Ρ€ΡˆΡ€ΡƒΡ‚Π½Ρ‹Ρ… ΠΊΠ°Ρ€Ρ‚ тСхнологичСского транспорта Π½Π΅Ρ„Ρ‚Π΅Π³Π°Π·ΠΎΠ΄ΠΎΠ±Ρ‹Π²Π°ΡŽΡ‰Π΅Π³ΠΎ прСдприятия. ΠŸΡ€Π΅Π΄Π»ΠΎΠΆΠ΅Π½ ΠΏΠΎΡ…ΠΎΠ΄ ΠΊ Ρ€Π΅Π°Π»ΠΈΠ·Π°Ρ†ΠΈΠΈ Ρ„ΡƒΠ½ΠΊΡ†ΠΈΠΉ формирования ΠΈΠ½Ρ„ΠΎΡ€ΠΌΠ°Ρ†ΠΈΠΎΠ½Π½Ρ‹Ρ… ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ состояний Π½Π° Π±Π°Π·Π΅ аспСктно-ΠΎΡ€ΠΈΠ΅Π½Ρ‚ΠΈΡ€ΠΎΠ²Π°Π½Π½ΠΎΠΉ ΠΏΠ°Ρ€Π°Π΄ΠΈΠ³ΠΌΡ‹

    Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions

    Get PDF
    The Temp Secretary Problem was recently introduced by [Fiat et al., ESA 2015]. It is a generalization of the Secretary Problem, in which commitments are temporary for a fixed duration. We present a simple online algorithm with improved performance guarantees for cases already considered by [Fiat et al., ESA 2015] and give competitive ratios for new generalizations of the problem. In the classical setting, where candidates have identical contract durations gamma << 1 and we are allowed to hire up to B candidates simultaneously, our algorithm is (1/2) - O(sqrt{gamma})-competitive. For large B, the bound improves to 1 - O(1/sqrt{B}) - O(sqrt{gamma}). Furthermore we generalize the problem from cardinality constraints towards general packing constraints. We achieve a competitive ratio of 1 - O(sqrt{(1+log(d) + log(B))/B}) - O(sqrt{gamma}), where d is the sparsity of the constraint matrix and B is generalized to the capacity ratio of linear constraints. Additionally we extend the problem towards arbitrary hiring durations. Our algorithmic approach is a relaxation that aggregates all temporal constraints into a non-temporal constraint. Then we apply a linear scaling algorithm that, on every arrival, computes a tentative solution on the input that is known up to this point. This tentative solution uses the non-temporal, relaxed constraints scaled down linearly by the amount of time that has already passed

    Elektronische Deichsel fΓΌr landwirtschaftliche Arbeitsmaschine - Auf dem Weg nach autonomen Landmaschinen

    Get PDF
    Diese Verâffentlichung stellt eine elektronische Deichsel für landwirtschaftliche Arbeitsmaschinen vor, die eine virtuelle Kopplung zwischen zwei Landmaschinen herstellen kann, damit eine mannlose Maschine einer führenden Maschine folgt und die gleiche Arbeit wie die führende gleichzeitig leisten kann. Die beiden Arbeitsmaschinen kânnen im Feldeinsatz von einem Fahrer wie eine bedient und eingesetzt werden und die von einer Arbeitskraft im Feld bediente Leistung und Zugkraft kânnen weiter gesteigert werden. In diesem Artikel wird zuerst der Systemaufbau der elektronischen Deichsel vorgestellt. Danach werden die Fahrmodi innerhalb der Deichsel gezeigt. Anschließend werden die Spurführung der mannlosen Maschine und die Kommunikation zwischen beiden Maschinen erlÀutert. Zum Schluss werden die Testergebnisse im realen Feld dargestellt

    The calibration and evaluation of speed-dependent automatic zooming interfaces.

    Get PDF
    Speed-Dependent Automatic Zooming (SDAZ) is an exciting new navigation technique that couples the user's rate of motion through an information space with the zoom level. The faster a user scrolls in the document, the 'higher' they fly above the work surface. At present, there are few guidelines for the calibration of SDAZ. Previous work by Igarashi & Hinckley (2000) and Cockburn & Savage (2003) fails to give values for predefined constants governing their automatic zooming behaviour. The absence of formal guidelines means that SDAZ implementers are forced to adjust the properties of the automatic zooming by trial and error. This thesis aids calibration by identifying the low-level components of SDAZ. Base calibration settings for these components are then established using a formal evaluation recording participants' comfortable scrolling rates at different magnification levels. To ease our experiments with SDAZ calibration, we implemented a new system that provides a comprehensive graphical user interface for customising SDAZ behaviour. The system was designed to simplify future extensions---for example new components such as interaction techniques and methods to render information can easily be added with little modification to existing code. This system was used to configure three SDAZ interfaces: a text document browser, a flat map browser and a multi-scale globe browser. The three calibrated SDAZ interfaces were evaluated against three equivalent interfaces with rate-based scrolling and manual zooming. The evaluation showed that SDAZ is 10% faster for acquiring targets in a map than rate-based scrolling with manual zooming, and SDAZ is 4% faster for acquiring targets in a text document. Participants also preferred using automatic zooming over manual zooming. No difference was found for the globe browser for acquisition time or preference. However, in all interfaces participants commented that automatic zooming was less physically and mentally draining than manual zooming

    Measurement of polarization transfer in the quasi-elastic 40Ca(e⃗,e′p⃗)^{40}{\rm Ca}(\vec{e},e' \vec{p}) process

    Full text link
    Polarization transfer to a bound proton in polarized electron knock-out reactions, A(e⃗,e′p⃗)\mathrm{A}(\vec{e},e^{\prime}\vec{p}), is a powerful tool to look for in-medium modification of the bound proton. It requires comparison to calculations which consider the many-body effects accompanying the quasi-free process. We report here measured components Px′P_x^{\prime}, Pz′P_z^{\prime}, and their ratio Px′/Pz′P_x^{\prime}/P_z^{\prime}, of polarization transfer to protons bound in 40Ca^{40}\mathrm{Ca}, which is described well by the shell model and for which reliable calculations are available. While the calculations capture the essence of the data, our statistical precision allows us to observe deviations which cannot be explained by simple scaling, including by varying the proton electromagnetic form factor ratio GE/GMG_E/G_M. We further explore the deviations of the ratio of the polarization transfer components from that of a free proton, (Px′/Pz′)A/(Px′/Pz′)H(P_x^{\prime}/P_z^{\prime})_{\rm A}/(P_x^{\prime}/P_z^{\prime})_{\rm H}, and its dependence on the bound-proton virtuality

    Introduction to VI-HPS

    No full text
    • …
    corecore